An Efficient Modified Particle Swarm Optimization Algorithm for Solving Mixed-Integer Nonlinear Programming Problems
نویسندگان
چکیده
منابع مشابه
A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...
متن کاملUse of Particle Swarm Optimization Algorithm for Solving Integer and Mixed Integer Optimization Problems
This paper presents use of Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart [1] for solving Integer and Mixed Integer Optimization problems. In PSO, The potential solutions, called particles, are flown through the problem space by learning from the current optimal particle and its memory. PSO is started with a group of feasible solutions and a feasibility function ...
متن کاملHybrid particle swarm algorithm for solving nonlinear constraint optimization problems
Based on the combination of the particle swarm algorithm and multiplier penalty function method for the constraint conditions, this paper proposes an improved hybrid particle swarm optimization algorithm which is used to solve nonlinear constraint optimization problems. The algorithm converts nonlinear constraint function into no-constraints nonlinear problems by constructing the multiplier pen...
متن کاملA Particle Swarm Optimization Algorithm for Mixed Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous and discrete variables. However, the number of studies scarcely exceeds a few on mixed-variable problems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariable nonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convex optimization problems. In this pa...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2019
ISSN: 1875-6883
DOI: 10.2991/ijcis.d.190402.001